Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata
نویسندگان
چکیده
We present a framework for obtaining effective characterizations of simple fragments of future temporal logic (LTL) with the natural numbers as time domain. The framework is based on prophetic automata (also known as complete unambiguous Büchi automata), which enjoy strong structural properties, in particular, they separate the “finitary fraction” of a regular language of infinite words from its “infinitary fraction” in a natural fashion. Within our framework, we provide characterizations of all natural fragments of temporal logic, where, in some cases, no effective characterization had been known previously, and give lower and upper bounds for their computational complexity.
منابع مشابه
Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata
We present a framework for obtaining effective characterizations of simple fragments of future temporal logic (LTL) with the natural numbers as time domain. The framework is based on a form of strongly unambiguous automata, also known as prophetic automata or complete unambiguous Büchi automata and referred to as Carton–Michel automata in this paper. These automata enjoy strong structural prope...
متن کاملClassifying Discrete Temporal Properties
This paper surveys recent results on the classiication of discrete temporal properties, gives an introduction to the methods that have been developed to obtain them, and explains the connections to the theory of nite automata, the theory of nite semigroups, and to rst-order logic. The salient features of temporal logic 1 are its modalities, which allow it to express temporal relationships. So i...
متن کاملDeeper Connections Between LTL and Alternating Automata
It is known that Linear Temporal Logic (LTL) has the same expressive power as alternating 1-weak automata (A1W automata, also called alternating linear automata or very weak alternating automata). A translation of LTL formulae into a language equivalent A1W automata has been introduced in [MSS88]. The inverse translation has been developed independently in [Roh97] and [LT00]. We improve the lat...
متن کاملDecidable Properties of Tree Languages
The first part of the thesis concerns problems related to the question: " when can a regular tree language be defined in first-order logic? " Characterizations in terms of automata of first-order logic and the related chain logic are presented. A decidable property of tree automata called confusion is introduced; it is conjectured that a regular tree language can be defined in chain logic if an...
متن کاملRankers over Infinite Words
We consider the fragments FO, Σ2 ∩ FO, Π2 ∩ FO, and ∆2 of first-order logic FO[<] over finite and infinite words. For all four fragments, we give characterizations in terms of rankers. In particular, we generalize the notion of a ranker to infinite words in two possible ways. Both extensions are natural in the sense that over finite words, they coincide with classical rankers and over infinite ...
متن کامل